Learnheuristics in routing and scheduling problems: A review

Combinatorial optimization problems (COPs) are the most important class of problems, with great practical significance. This is concerned identifying best solution from a discrete set all available options. The transportation (routing) and distribution (scheduling) systems considered challenging examples COPs. Given importance routing scheduling many methods have been proposed to address them. These can be categorized into traditional (exact metaheuristics (MHs) methods) machine learning (ML) methods. ML overcome that suffer from, especially high computational time dependence on knowledge experts. Recently, MHs combined tackle COPs, then learnheuristics term emerged. combination aims guide toward an efficient, effective, robust search improve their performance in terms quality. work reviews publications which collaboration between has utilized propose guideline for researchers put forward new algorithms good ability solve problems.